Method and apparatus for table aging in a network switch

ABSTRACT

Embodiments of the present invention relate to a centralized table aging module that efficiently and flexibly utilizes an embedded memory resource, and that enables and facilitates separate network controllers. The centralized table aging module performs aging of tables in parallel using the embedded memory resource. The table aging module performs an age marking process and an age refreshing process. The memory resource includes age mark memory and age mask memory. Age marking is applied to the age mark memory. The age mask memory provides per-entry control granularity regarding the aging of table entries.

RELATED APPLICATIONS

This application is a divisional of U.S. patent application Ser. No.14/289,548, filed on May 28, 2014, and entitled “METHOD AND APPARATUSFOR TABLE AGING IN A NETWORK SWITCH” which is also hereby incorporatedby reference.

FIELD OF INVENTION

The present invention relates to table aging in a high speed networkswitch. More particularly, the present invention relates to method andapparatus for table aging in a network switch.

BACKGROUND OF THE INVENTION

Prior art network switches implement table aging. In particular, duringa packet processing stage, a lookup is done at certain table. Thematched entry in that table is tagged as hit. Entry hit information forall table entries are stored in memory. Either a periodic hardware orsoftware process monitors the entry hit information. An action can beperformed if a table entry has not been hit for a period of time. Forexample, aging of MAC addresses is used to evict and update forwardingtable entries. In some other cases, this mechanism can be used fornetwork debugging.

Prior art network switches allocate a fixed set of memory that is usedto age out a fixed set of tables. In modern system-on-chip (SOC)designs, area and power budget of embedded memory usually dominates theentire chip budget. As a result, it is critical to efficiently andflexibly utilize the limited memory resources.

Software defined networking (SDN) has emerged as a disruptive innovationto the industry. It advocates separation of control plane and high-speeddata plane of network equipment. Control of the network, such as flowmanagement, route update, table aging, is traditionally done in aspecialized hardware switch chip. However, in the new era of SDN, thesecomplicated functions are moved into separate controller. Such changescall for a new and different approach for architecture andimplementation of the data plane, most notably, network switch chips.

BRIEF SUMMARY OF THE INVENTION

Embodiments of the present invention relate to a centralized table agingmodule that efficiently and flexibly utilizes an embedded memoryresource, and that enables and facilitates separate network controllers.The centralized table aging module performs aging of tables in parallelusing the embedded memory resource. The table aging module performs anage marking process and an age refreshing process. The memory resourceincludes age mark memory and age mask memory. Age marking is applied tothe age mark memory. The age mask memory provides per-entry controlgranularity regarding the aging of table entries.

In one aspect, a network switch is provided. The network switch includesat least one core that includes a plurality of processing units. Thenetwork switch also includes an on-chip memory that stores a pluralityof search tables. The plurality of processing units communicates withthe on-chip memory to perform table searching. The network switch alsoincludes a table aging module that includes its own embedded memory. Thetable aging module is able to age any of the plurality of search tables.In some embodiments, once there is a search table hit, the table agingmodule receives a Table ID and a hit address from a corresponding searchrequest.

In some embodiments, the table aging module performs an age markingprocess and an age refreshing process. The age marking process sets anage memory bit as marked (e.g., to 1) every time a corresponding searchtable hit occurs. The age refreshing process examines all age memorybits corresponding to the search tables. The examination occurs eitherperiodically based on a configured cycle time or is specificallytriggered by software. When an age memory bit is unmarked (e.g., 0),software is notified that a respective table entry is stale, and whenthe age memory bit is marked (e.g., 1), the age memory bit is reset asunmarked (e.g., 0) in preparation for next round of age marking and agerefreshing.

In some embodiments, the network also includes an aging configurationsset that is used by the table aging module. The aging configurations setincludes configurations, age profiles and a central aging memory pool.

In some embodiments, each of the plurality of search tables is in one ofthe aging configurations and includes an aging enable bit and a pointerinto one of the age profiles.

In some embodiments, each of the age profiles specifies a refresh timeperiod for a search table and specifies an aging memory allocation inthe central aging memory pool. The central aging memory pool isembedded. Alternatively, the central aging memory pool is a part of theon-chip memory.

In some embodiments, the central aging memory pool includes age markmemory and age mask memory. In some embodiments, each of the age markmemory and the age mask memory contains multiple physical memory tiles,wherein memories of the central aging memory pool are group into tiles.Age marking is applied to the age mark memory. The age mask memoryprovides per-entry control granularity, wherein when a mask bit is setto 0, a corresponding table entry does not participate in an agingprocess.

In another aspect, a table aging module in a network switch is provided.The table aging module includes aging memory tiles. The aging memorytiles typically includes age mark memory and age mask memory.

The table aging module also includes an age marking process. The agemarking process typically includes an input queue for buffering agemarking inputs for table hits to the aging memory tiles.

The table aging module also includes an age refreshing process. The agerefreshing process typically includes a bit-wise OR operation of aread-out age mark data in the age mark memory with the inverse of a maskbit in the age mask memory.

In some embodiments, the table aging module also includes an ageinterrupt queue. When the result of the operation is not all 1's, theresult and memory tile address and row address for an aging memory row,which corresponds to a set of search table entries, are pushed into theage interrupt queue.

In some embodiments, the table aging module also includes a refreshstate machine for controlling the age refreshing process.

In yet another aspect, a method of a network switch is provided. Themethod includes parallel processing multiple table search requests. Themethod also includes, upon a table hit, generating information forprocessing by a table aging module. The method also includes the tableaging module performing aging of tables in parallel using a centralaging memory pool. The table aging module uses the generated informationto perform the aging of tables.

In some embodiments, the aging of tables involves two separate processesincluding an age marking process and an age refreshing process. In someembodiments, the age refreshing process can be paused.

In some embodiments, the method also includes, prior to parallelprocessing multiple table search requests programmably assigning a firstsubset of the tiles as an age mark memory, programmably assigning asecond subset of the tiles as an age mask memory, and programmablyconfiguring the table aging module.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing will be apparent from the following more particulardescription of example embodiments of the invention, as illustrated inthe accompanying drawings in which like reference characters refer tothe same parts throughout the different views. The drawings are notnecessarily to scale, emphasis instead being placed upon illustratingembodiments of the present invention.

FIG. 1 illustrates an exemplary aspect of a network switch according toan embodiment of the present invention.

FIG. 2 illustrates an aging configurations set according to anembodiment of the present invention.

FIG. 3 illustrates an exemplary central aging memory pool according toan embodiment of the present invention.

FIG. 4 illustrates a block diagram of a table aging module according toan embodiment of the present invention.

FIG. 5 illustrates a method of aging according to an embodiment of thepresent invention.

DETAILED DESCRIPTION OF THE INVENTION

In the following description, numerous details are set forth forpurposes of explanation. However, one of ordinary skill in the art willrealize that the invention can be practiced without the use of thesespecific details. Thus, the present invention is not intended to belimited to the embodiments shown but is to be accorded the widest scopeconsistent with the principles and features described herein.

Embodiments of the present invention relate to a centralized table agingmodule that efficiently and flexibly utilizes an embedded memoryresource, and that enables and facilitates separate network controllers.The centralized table aging module performs aging of tables in parallelusing the embedded memory resource. The table aging module performs anage marking process and an age refreshing process. The memory resourceincludes age mark memory and age mask memory. Age marking is applied tothe age mark memory. The age mask memory provides per-entry controlgranularity regarding the aging of table entries.

FIG. 1 illustrates an exemplary aspect of a network switch 100 accordingto an embodiment of the present invention. The network switch 100includes one or more cores 105 and a traffic manager 110. Each core 105typically includes a plurality of pipeline stages. The plurality ofpipeline stages includes a plurality of packet processing units 115 andat least one packet modifier 120. All processing units 115, 120 in theone or more cores 105 communicate with an on-chip memory 125 to performtable searching. The on-chip memory 125 can store one or more searchtables. A search table is either aging enabled or aging disabled. Eachof the plurality of packet processing units 115 is able to access theone or more search tables.

The on-chip memory 125 is coupled with a table aging module 130. Thetable aging module 130 includes its own embedded memory. The embeddedmemory typically works behind the on-chip memory 125 that is used fortable searching. The embedded memory can be utilized to age any searchtable in the table search memory pool 125. Typically, once there is asearch table hit, the aging module 130 of FIG. 1 receives a Table ID anda hit address from the corresponding search request.

The table aging module 130 performs at least two separate processes,including an age marking process and an age refreshing process. Forthose search tables that are configured as aging enabled, there arememory bits in the embedded memory of the table aging module 130corresponding to each table entry. The age marking process sets an agememory bit to 1 every time a corresponding search table hit occurs.Either periodically based on configured cycle time (i.e., automaticaging mode) or specifically triggered by software (i.e., triggeredmode), the age refreshing process examines all age memory bitscorresponding to the search tables. If the age memory bit is 0, meaningthat the respective table entry has not been hit since the previousaging refreshing process, then software is notified that that respectivetable entry is stale. If the age memory bit is 1, meaning that therespective table entry is active, then the age memory bit is reset to 0in preparation for next round of age marking and age refreshing.

There are typically many search tables in a feature-rich network switch,such as the network switch 100. For example, there can be more than 160search tables for the entire SOC chip of the network switch 100.Exemplary search tables include but are not limited to a routing table,an access control list (ACL), a flow table and the like. Directly agingthe 160 or more search tables can be too much for the SOC chip to handleat one time and of less practical use.

FIG. 2 illustrates an aging configurations set 200 according to anembodiment of the present invention. In some embodiments, the agingconfigurations set 200 is used by the table aging module 130 of FIG. 1.The aging configurations set 200 includes configurations 205, ageprofiles 210 and a central aging memory pool 215.

In some embodiments, 64 age profiles 210 are provided for more than 160search tables. However, more or less age profiles can be provided. Eachof the search tables, which is in one of the aging configurations 205,includes an aging enable bit (i.e., age_en) and a pointer (i.e., cfg_id)into one of the 64 age profiles 210. The age_en indicates weather thesearch table is aging enabled.

Each age profile 210 specifies a refresh time period (i.e., refr_period)for the search table. The refresh time period advantageously allows fordifferent aging granularity for flexibility in the higher level system.For example, a MAC table entry can be aged out after a few minutes ofinactivity. For another example, a flow table entry can be declaredinactive after a few seconds. The age profile also specifies agingmemory allocation (i.e., mem_row_offset, mem_row_inc) in the centralaging memory pool 215.

In some embodiments, the table aging module 130 of FIG. 1 uses acentralized common memory pool. The aging memory pool 215 of FIG. 2 is apart of the centralized common memory pool. In some embodiments, thecentralized common memory pool is embedded. Alternatively, thecentralized common memory pool is a part of the on-chip memory 125 ofFIG. 1.

In some embodiments, each table search request specifies whether or notthat particular search should participate in the aging process, even ifthe corresponding search table is age enabled. One example of thisflexibility is aging of a MAC table. Typically, there is only one tablefor MAC address lookup. The source MAC address look up may want toparticipate in the aging process. However, the destination MAC addresslook up may not want to participate in the aging process because thedestination may have already moved away from the current destinationport without the network switch yet having this knowledge.

FIG. 3 illustrates an exemplary central aging memory pool 300 accordingto an embodiment of the present invention. In some embodiments, thecentral aging memory pool 215 of FIG. 2 is similarly configured as thecentral aging memory pool 300. The central aging memory pool 300includes age mark memory 305 and age mask memory 310, each of whichcontains multiple physical memory tiles. In some embodiments, thememories of the memory pool 300 are grouped into tiles. The tilestypically contain the same number of memories. In some embodiments, eachtile is 64-bit wide and 2048-entry deep. As shown in FIG. 3, eightmemory tiles are used to construct each of the age mark memory 305 andthe age mask memory 310. However, each of the age mark memory 305 andthe age mask memory 310 can be constructed with more or less memorytiles. The number of memory tiles for the age mark memory 305 can be thesame as or different from the number of memory tiles for the age maskmemory 310.

Age marking is applied to the age mark memory 305, as described above.The age mask memory 310 provides per-entry control granularity. If amask bit is set to 0, then the corresponding table entry does notparticipate in the aging process. The per-entry control granularityprovides numerous benefits. For example, a system would like to removeany stale entries in a routing table. However, there might be somerouting entries that are statically configured that should never beevicted.

FIG. 4 illustrates a block diagram of a table aging module 400 accordingto an embodiment of the present invention. In some embodiments, thetable aging module 130 of FIG. 1 is similarly configured as the tableaging module 400. The table aging module 400 allows for the parallelprocessing of table aging.

During the age marking process, age marking inputs for table hits toaging memory tiles 405, 410 are buffered in an input queue 415, whichcan be a FIFO buffer, in case of aging memory oversubscription. Softwarecan configure the aging process to match perfectly with the bandwidth ofthe age mark memory 405, which means that only a few tables will beaged. Alternatively, software can configure the aging process toconfigure many tables to be aged. However, it is possible that not alltable hits will be marked, in which marking will become probabilistic.The age marking inputs for each table hit includes Table ID (i.e., tblage) and a table hit address. The table hit address is used to map toexactly one bit in one row of the corresponding age mark memory 405.

During the age refreshing process, the read-out age mark data in the agemark memory 405 is bit-wise OR-ed with the inverse of the mask bit inthe age mask memory 410. If the result is all 1's, then each of theentries has been hit during the past refresh. However, if the result isnot all 1's, then there are one or more entries that have not been hitduring the past refresh event. The age mark memory tile address and rowaddress, as well as the OR-ed data, are pushed into an age interruptqueue 425, which can be a FIFO buffer. An interrupt is then sent to aCPU, such as an external system CPU, for eviction purposes, networkdebugging purposes and/or other purposes.

A refresh state machine 420 typically controls the age refreshingprocess. Table 1 lists configurations of the refresh state machine 420.

TABLE 1 Field Width Description mode  1 Automatic aging mode ortriggered mode trig_cfg_bmp 64 If it is in triggered mode, which of the64 age profiles will do refresh en_pause  1 If set, age refresh processwill pause when age interrupt FIFO occupancy exceeds the configuredthreshold, as below fifo_thd 6 unit_time 32 All aging events are timebased on number of unit_time clock cyclesThe mode of the aging unit (i.e., automatic aging mode or triggeredmode) is specified by the mode field. The unit_time field defines thenumber of clock cycles aging events are based off of.

If the aging unit is in the automatic aging mode, then the agerefreshing process periodically examines all age memory bitscorresponding to the search tables based on the configured cycle time.

If the aging unit is in the triggered mode, then the trig_cfg_bmp fieldindicates which of the 64 age profiles will do the age refreshingprocess upon a system CPU write.

Typically, the hardware aging process runs orders of magnitude fasterthan the software in the CPU, the age interrupt queue 425 could easilyoverflow. Based on the en_pause field, the refreshing process can pauseonce the age interrupt queue 425 occupancy level exceeds certainconfigured threshold, as set by the fifo_thd field. The age refreshingprocess typically pauses until the CPU drains the age interrupt queue425 below the configured threshold.

Due to limited memory bandwidth or processing rate, not all table hitsmay be marked in a certain aging configuration, which can result in afalse aging alarm. However, due to the nature of network traffic, mostactive flows will have more than one packet going through the switch.So, even if one packet misses the age marking process, it is unlikelythat all packets will miss the age marking process, especially if theaging refresh cycle is reasonably long enough, which is the case forpractical use cases. Furthermore, this hardware architecture enablessoftware to implement different table aging mechanisms in higher levelapplications, such as aging with age counters of more than 1-bit width.

FIG. 5 illustrates a method of aging 500 according to an embodiment ofthe present invention. The method 500 is typically performed by thenetwork switch 100 of FIG. 1. As discussed above, the network switch 100includes the on-chip memory 125. The plurality of packet processingunits 115 communicates with the on-chip memory 125 to perform tablesearching.

At a step 505, multiple table search requests are processed in parallel.

At a step 510, upon a table hit, information is generated for processingby a table aging module.

At a step 515, the table aging module performs aging of tables inparallel using a central aging memory pool. The table aging moduletypically uses the generated information to perform the aging of tables.As discussed above, the aging of tables involves two separate processes,including an age marking process and an age refreshing process. Thecentral aging memory pool includes an age mark memory and an age maskmemory.

The age marking process includes an input queue for buffering agemarking inputs for table hits to the aging memory tiles, while the agerefreshing process includes a bit-wise OR operation of a read-out agemark data in the age mark memory with the inverse of a mask bit in theage mask memory. If the result is all 1's, then each of the entries hasbeen hit during the past refresh or needs to be saved. However, if theresult is not all 1's, then there are one or more entries that have notbeen hit during the past refresh event. The memory tile address and rowaddress for those routing entries, as well as the OR-ed data are pushedinto an age interrupt queue. An interrupt is then sent to a CPU, such asan external system CPU, for eviction purposes, network debuggingpurposes and/or other purposes. In some embodiments, the age refreshingprocess can be paused to prevent overflow of the age interrupt queue.

In some embodiments, the method 500 also includes, prior to parallelprocessing multiple table search requests at the step 505 programmablyassigning a first subset of the tiles as an age mark memory,programmably assigning a second subset of the tiles as an age maskmemory, and programmably configuring the table aging module. Unlikeprior art networking switches that uses dedicated memory for tableaging, the network switch 100 uses a centralized table aging module thatefficiently and flexibly uses embedded memory resource for table aging.

One of ordinary skill in the art will realize other uses and advantagesalso exist. While the invention has been described with reference tonumerous specific details, one of ordinary skill in the art willrecognize that the invention can be embodied in other specific formswithout departing from the spirit of the invention. Thus, one ofordinary skill in the art will understand that the invention is not tobe limited by the foregoing illustrative details, but rather is to bedefined by the appended claims.

1-16. (canceled)
 17. A table aging module in a network switch, the tableaging module comprising: aging memory tiles including age mark memoryincluding age memory bit values and age mask memory including mask bitvalues for each entry of a plurality of search tables, wherein each ofthe age memory bit values indicate whether a corresponding one of theentries has been subject to a search hit since a previous aging process;and a processing circuit that determines if a request aging indicator ofa table search request indicates that aging is disabled for the tablesearch request, wherein at least one of the entries is hit by the tablesearch request and refrains from updating the age memory bit values ofthe at least one of the entries when the request aging indicatorindicates that aging is disabled for the table search request even ifthe aging configuration indicator value of the search table storing theat least one of the entries indicates that aging is enabled.
 18. Thetable aging module of claim 27, further comprising an age interruptqueue.
 19. The table aging module of claim 18, wherein when the resultof the operation is not all a same value, the result and memory tileaddress and row address for an aging memory row, which corresponds to aset of search table entries, are pushed into the age interrupt queue.20. The table aging module of claim 27, further comprising a refreshstate machine for controlling the age refreshing process. 21-25.(canceled)
 26. The table aging module of claim 17, further comprising aninput queue for buffering age marking inputs for table hits to the agingmemory tiles in an age marking process performed by the processingcircuit.
 27. The table aging module of claim 26, wherein the processingcircuit performs an age refreshing process including a bit-wise ORoperation of a read-out age mark data in the age mark memory with theinverse of a mask bit in the age mask memory.
 28. A non-transitorycomputer-readable medium storing a table aging module, the table agingmodule including both mask bit values and an age memory bit value foreach entry of each of a plurality of search tables in a central agingmemory pool, wherein each of the age memory bit values indicate whethera corresponding one of the entries has been subject to a search hitsince a previous aging process, wherein the table aging module:determines if a request aging indicator of a table search requestindicates that aging is disabled for the table search request, whereinat least one of the entries is hit by the table search request; andrefrains from updating the age memory bit values of the at least one ofthe entries when the request aging indicator indicates that aging isdisabled for the table search request even if the aging configurationindicator value of the search table storing the at least one of theentries indicates that aging is enabled.
 29. The non-transitorycomputer-readable medium of claim 28, wherein the table aging moduleincludes aging memory tiles apportioned into age mark memory and agemask memory.
 30. The non-transitory computer-readable medium of claim29, wherein the table aging module performs an age marking process usingan input queue for buffering age marking inputs for table hits to theaging memory tiles.
 31. The non-transitory computer-readable medium ofclaim 30, wherein the table aging module performs an age refreshingprocess including a bit-wise OR operation of a read-out age mark data inthe age mark memory with the inverse of a mask bit in the age maskmemory.
 32. The non-transitory computer-readable medium of claim 31,wherein the table aging module includes an age interrupt queue.
 33. Thenon-transitory computer-readable medium of claim 32, wherein when aresult of the bit-wise OR operation is not all a same value, the tableaging module pushes the result and memory tile address and row addressfor an aging memory row that corresponds to a set of the entries, intothe age interrupt queue.
 34. The non-transitory computer-readable mediumof claim 33, wherein the table aging module includes a refresh statemachine for controlling the age refreshing process.
 35. Thenon-transitory computer-readable medium of claim 34, wherein the agerefreshing process examines all age memory bits corresponding to theplurality of search tables.
 36. The non-transitory computer-readablemedium of claim 35, wherein the examination occurs periodically based ona configured cycle time or is specifically triggered by software. 37.The non-transitory computer-readable medium of claim 36, wherein when anage memory bit is unmarked, software is notified that a respective tableentry is stale, and when the age memory bit is marked, the age memorybit is reset as unmarked in preparation for next round of age markingand age refreshing.
 38. The non-transitory computer-readable medium ofclaim 37, wherein the table aging module identifies both the mask bitvalue of one or more of the entries and the aging configurationindicator value of the search table storing the one or more of theentries.
 39. The non-transitory computer-readable medium of claim 38,wherein the table aging module, based on both the aging configurationindicator value of the search table storing the one or more of theentries and the mask bit values of the one or more of the entries,refrains from aging the one or more of the entries, regardless of theage memory bit values of the one or more entries, if the agingconfiguration indicator value of the search table storing the one ormore of the entries indicates that the search table storing the one ormore of the entries should be aged, but the mask bit values indicatethat the one or more of the entries should not be aged.
 40. A tableaging module in a network switch, the table aging module comprising:mask bit values and an age memory bit value for each entry of each of aplurality of search tables in a central aging memory pool, wherein eachof the age memory bit values indicate whether a corresponding one of theentries has been subject to a search hit since a previous aging process;means for determining if a request aging indicator of a table searchrequest indicates that aging is disabled for the table search request,wherein at least one of the entries is hit by the table search request;and means for refraining from updating the age memory bit values of theat least one of the entries when the request aging indicator indicatesthat aging is disabled for the table search request even if the agingconfiguration indicator value of the search table storing the at leastone of the entries indicates that aging is enabled.
 41. The table agingmodule of claim 40, further comprising aging memory tiles apportionedinto age mark memory and age mask memory.
 42. The table aging module ofclaim 41, further comprising means for performing an age marking processusing an input queue for buffering age marking inputs for table hits tothe aging memory tiles.
 43. The table aging module of claim 42, furthercomprising means for performing an age refreshing process including abit-wise OR operation of a read-out age mark data in the age mark memorywith the inverse of a mask bit in the age mask memory.
 44. The tableaging module of claim 43, further comprising an age interrupt queue. 45.The table aging module of claim 44, wherein when a result of thebit-wise OR operation is not all a same value, further comprising meansfor pushing the result and memory tile address and row address for anaging memory row that corresponds to a set of the entries, into the ageinterrupt queue.
 46. The table aging module of claim 45, furthercomprising a refresh state machine for controlling the age refreshingprocess.
 47. The table aging module of claim 46, further comprisingmeans for examining all age memory bits corresponding to the pluralityof search tables.
 48. The table aging module of claim 47, wherein theexamination occurs periodically based on a configured cycle time or isspecifically triggered by software.
 49. The table aging module of claim48, wherein when an age memory bit is unmarked, software is notifiedthat a respective table entry is stale, and when the age memory bit ismarked, the age memory bit is reset as unmarked in preparation for nextround of age marking and age refreshing.
 50. The table aging module ofclaim 49, further comprising means for identifying both the mask bitvalue of one or more of the entries and the aging configurationindicator value of the search table storing the one or more of theentries.
 51. The table aging module of claim 50, wherein the means forrefraining, based on both the aging configuration indicator value of thesearch table storing the one or more of the entries and the mask bitvalues of the one or more of the entries, refrains from aging the one ormore of the entries, regardless of the age memory bit values of the oneor more entries, if the aging configuration indicator value of thesearch table storing the one or more of the entries indicates that thesearch table storing the one or more of the entries should be aged, butthe mask bit values indicate that the one or more of the entries shouldnot be aged.
 52. A non-transitory computer-readable medium storing atable aging element, the table aging element including both mask bitvalues and an age memory bit value for each entry of each of a pluralityof search tables in a central aging memory pool, wherein each of the agememory bit values indicate whether a corresponding one of the entrieshas been subject to a search hit since a previous aging process, whereinthe table aging element: determines if a request aging indicator of atable search request indicates that aging is disabled for the tablesearch request, wherein at least one of the entries is hit by the tablesearch request; refrains from updating the age memory bit values of theat least one of the entries when the request aging indicator indicatesthat aging is disabled for the table search request even if the agingconfiguration indicator value of the search table storing the at leastone of the entries indicates that aging is enabled; identifies both themask bit value of one or more of the entries and the aging configurationindicator value of the search table storing the one or more of theentries; and based on both the aging configuration indicator value ofthe search table storing the one or more of the entries and the mask bitvalues of the one or more of the entries, refrains from aging the one ormore of the entries, regardless of the age memory bit values of the oneor more entries, if the aging configuration indicator value of thesearch table storing the one or more of the entries indicates that thesearch table storing the one or more of the entries should be aged, butthe mask bit values indicate that the one or more of the entries shouldnot be aged.